Deterministic soliton automata with at most one cycle
نویسندگان
چکیده
منابع مشابه
Maximal Independent Sets in Graphs with at Most One Cycle
In this paper, we determine the largest number of maximal independent sets among all connected graphs of order n, which contain at most one cycle. We also characterize those extremal graphs achieving this maximum value. As a consequence, the corresponding results for graphs with at most one cycle but not necessarily connected are also given.
متن کاملCycle Analysis for Deterministic Finite State Automata
A method for the determination of all cycles of deterministic finite state automata is presented. Using a finite field description GF(2) these automata are shown to correspond to multilinear state equations. Basic results from feedback shift register theory are recalled and developed towards a complete analysis tool for affine-linear automata. The multilinear case is reduced to the affine-linea...
متن کاملDeterministic Soliton Graphs
Soliton graphs are studied in the context of a reduction procedure that simplifies the structure of graphs without affecting the deterministic property of the corresponding automata. It is shown that an elementary soliton graph defines a deterministic automaton iff it reduces to a graph not containing even-length cycles. Based on this result, a general characterization is given for deterministi...
متن کاملSoliton automata with constant external edges
Soliton automata are the mathematical models of certain possible molecular switching devices. Both from theoretical and practical point of view, it is a central question to describe soliton automata with constant external edges. Extending a result of Dassow and Jürgensen, we characterize soliton automata in this special case.
متن کاملQuantization of Soliton Cellular Automata
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian describing a quantum chain model is constructed. The intrinsic parallelism of QSCA, a phenomenon first known from quantum computers, is also emphasized.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1993
ISSN: 0022-0000
DOI: 10.1016/0022-0000(93)90002-e